a meta-heuristic approach to cvrp problem: local search optimization based on ga and ant colony

Ant Colony Optimization: A New Meta-Heuristic

Recently, a number of algorithms inspired by the foraging behavior of ant colonies have been applied to the solution of difficult discrete optimization problems. In this paper we put these algorithms in a common framework by defining the Ant Colony Optimization (ACO) meta-heuristic. A couple of paradigmatic examples of applications of these novel meta-heuristic are given, as well as a brief ove...

The Ant Colony Optimization Meta-Heuristic

Ant Colony Optimization Based on An Improvement Local Search Strategy

The traveling salesman problem (TSP) has been an extensively studied problem for a long time and has attracted a considerable amount of research effort. Ant colony system (ACS) algorithm is better method to solve TSP. This paper presents HACS-LS, a hybrid ant colony optimization approach combined with an improvement local search algorithm, applied to traveling salesman problem. The improvement ...

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

A general purpose Hyper – Heuristic based on Ant colony optimization

In the plan of the CHESC2001 competition [1], an hyper heuristic has been designed based on the Ant Colony Optimization method (from now ACO). According to the competition goals, the algorithm was developed with the intention to produce an independent model of the problem domain and the particular instance to be solved. This means that the hyper-heuristic is abstracted from the features of each...

A Hybrid Ant Colony Optimization(HACO) for Solving Capacitated Vehicle Routing Problem(CVRP)

The Capacitated Vehicle Routing Problem (CVRP) is a combinatorial optimization and nonlinear problem seeking to service a number of customers with a fleet of vehicles. CVRP is an important problem in the fields of transportation, distribution and logistics. Usually, the goal is delivering goods located at a central depot to customers who have placed orders. This transportation optimization prob...